Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time

Scheduling Identical Parallel Machines to Minimize Total Weighted Completion Time

Scheduling jobs with equal-processing-time on parallel machines with non-identical capacities to minimize makespan

We consider the problem of scheduling a set of equal-processing-time jobs with arbitrary job sizes on a set of batch machines with different capacities. A job can only be assigned to a machine whose capacity is not smaller than the size of the job. Our goal is to minimize the schedule length (makespan). We show that there is no polynomial-time approximation algorithm with an absolute worst-case...

Scheduling on parallel identical machines to minimize total tardiness

This paper focuses on the problem of scheduling n independent jobs on m identical parallel machines for the objective of minimizing total tardiness of the jobs. We develop dominance properties and lower bounds, and develop a branch and bound algorithm using these properties and lower bounds as well as upper bounds obtained from a heuristic algorithm. Computational experiments are performed on r...

Scheduling on uniform parallel machines to minimize maximum lateness

We consider the uniform parallel machine scheduling problem with the objective of minimizing maximum lateness. We show that an extension of the EDD rule to a uniform parallel machine setting yields a maximum lateness value which does not exceed the optimal value by more than pmax, where pmax is the maximum job processing time. c © 2000 Elsevier Science B.V. All rights reserved.

Better Heuristics for a Two-Stage Multi-Machine Assembly Scheduling Problem to Minimize Total Completion Time

 We address the two-stage multi-machine assembly scheduling problem to minimize total completion times of all jobs. The first stage consists of m independently working machines where each machine produces its own component. The second stage consists of two independent and identical assembly machines. The processing of a job at the second stage cannot start until its m components, produced by t...